منابع مشابه
Planning as satisfiability: Heuristics
Reduction to SAT is a very successful approach to solving hard combinatorial problems in Artificial Intelligence and computer science in general. Most commonly, problem instances reduced to SAT are solved with a general-purpose SAT solver. Although there is the obvious possibility of improving the SAT solving process with application-specific heuristics, this has rarely been done successfully. ...
متن کاملHeuristics for HTN Planning as Satisfiability
Classical planning is the problem of synthesizing a sequence of actions to reach the goal state starting from the initial state. Hierarchical task networks (HTNs) have been used as a guidance for solving planning problems where tasks are decomposed into subtasks. Recently, both action-based planning as well as HTNbased planning have been east as SAT. The performance of planning as SAT has been ...
متن کاملDeconstructing Planning as Satisfiability
The idea of encoding planning as satisfiability was proposed in 1992 as a method for generating interesting SAT problems, but did not appear to be a practical approach to planning (Kautz & Selman 1992). This changed in 1996, when Satplan was shown to be competitive with current planning technology, leading to a mini-explosion of interest in the approach (Kautz & Selman 1996). Within a few years...
متن کاملSAS+ Planning as Satisfiability
Planning as satisfiability is a principal approach to planning with many eminent advantages. The existing planning as satisfiability techniques usually use encodings compiled from STRIPS. We introduce a novel SAT encoding scheme (SASE) based on the SAS+ formalism. The new scheme exploits the structural information in SAS+, resulting in an encoding that is both more compact and efficient for pla...
متن کاملRefinement-Based Planning as Satisfiability
A classical planning problem is the problem of computing a sequence of actions that transforms one state of the world into the desired. Traditional planners cast planning as a "split & prune" type search. These are called "refinement planners" since they start with a null plan and refine it by adding constraints. It has been shown recently that planning problems are far easier to solve when the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Artificial Intelligence
سال: 2012
ISSN: 0004-3702
DOI: 10.1016/j.artint.2012.08.001